Almost Rich Words as Morphic Images of Rich Words
نویسندگان
چکیده
We focus on Θ-rich and almost Θ-rich words over a finite alphabet A, where Θ is an involutive antimorphism over A∗. We show that any recurrent almost Θ-rich word u is an image of a recurrent Θ′-rich word under a suitable morphism, where Θ′ is also an involutive antimorphism. Moreover, if the word u is uniformly recurrent, we show that Θ′ can be set to the reversal mapping. We also treat one special case of almost Θ-rich words: we show that every Θ-standard word with seed is an image of an Arnoux-Rauzy word.
منابع مشابه
Palindromic Richness
In this paper, we study combinatorial and structural properties of a new class of finite and infinite words that are ‘rich’ in palindromes in the utmost sense. A characteristic property of so-called rich words is that all complete returns to any palindromic factor are themselves palindromes. These words encompass the well-known episturmian words, originally introduced by the second author toget...
متن کاملOn Uniformly Recurrent Morphic Sequences
In the paper we mainly deal with two well-known types of in nite words: morphic and uniformly recurrent (=almost periodic). We discuss the problem of nding criterion of uniform recurrence for morphic sequences and give e ective polynomial-time such criterion in two particular cases: pure morphic sequences and automatic sequences. We also prove that factor complexity of arbitrary uniformly recur...
متن کاملOn some problems related to palindrome closure
In this paper we solve some open problems related to (pseudo)palindrome closure operators and to the infinite words generated by their iteration, that is, standard episturmian and pseudostandard words. We show that if θ is an involutory antimorphism of A, then both θ-palindromic closures of any factor of a θ-standard word are also factors of some θ-standard word. We also introduce the class of ...
متن کاملInfinite Words with Well Distributed Occurrences
In this paper we introduce the well distributed occurrences (WDO) combinatorial property for infinite words, which guarantees good behavior (no lattice structure) in some related pseudorandom number generators. An infinite word u on a d-ary alphabet has the WDO property if, for each factor w of u, positive integer m, and vector v ∈ Zm, there is an occurrence of w such that the Parikh vector of ...
متن کاملPseudopalindrome closure operators in free monoids
We consider involutory antimorphisms θ of a free monoid A∗ and their fixed points, called θ-palindromes or pseudopalindromes. A θ-palindrome reduces to a usual palindrome when θ is the reversal operator. For any word w ∈ A∗ the right (resp. left) θ-palindrome closure of w is the shortest θ-palindrome having w as a prefix (resp. suffix). We prove some results relating θ-palindrome closure operat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 23 شماره
صفحات -
تاریخ انتشار 2012